On spectral theory of a k-uniform directed hypergraph
نویسندگان
چکیده
In this paper, we study a k-uniform directed hypergraph in general form and introduce its associated tensors. We present different spectral properties show that some of them are generalization the classical results for undirected hypergraphs. The notation odd-bipartite presented characterizations comparing with ones hypergraphs studied. also power cored investigate their properties.
منابع مشابه
ON SENSITIVITY OF k-UNIFORM HYPERGRAPH PROPERTIES
In this paper we present a graph property with sensitivity Θ( √ n), where n = (v 2 ) is the number of variables, and generalize it to a k-uniform hypergraph property with sensitivity Θ( √ n), where n = (v k ) is again the number of variables. This yields the smallest sensitivity yet achieved for a k-uniform hypergraph property. We then show that, for even k, there is a k-uniform hypergraph prop...
متن کاملOn the Sensitivity of k-Uniform Hypergraph Properties
In this paper we present a graph property with sensitivity Θ( √
متن کاملOn the Sensitivity Complexity of k-Uniform Hypergraph Properties
In this paper we investigate the sensitivity complexity of hypergraph properties. We present a k-uniform hypergraph property with sensitivity complexity O(n⌈k/3⌉) for any k ≥ 3, where n is the number of vertices. Moreover, we can do better when k ≡ 1 (mod 3) by presenting a k-uniform hypergraph property with sensitivity O(n⌈k/3⌉−1/2). This result disproves a conjecture of Babai [1], which conje...
متن کاملA Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning
Matrix spectral methods play an important role in statistics and machine learning, and most often the word ‘matrix’ is dropped as, by default, one assumes that similarities or affinities are measured between two points, thereby resulting in similarity matrices. However, recent challenges in computer vision and text mining have necessitated the use of multi-way affinities in the learning methods...
متن کاملDiffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian
In spectral graph theory, the Cheeger’s inequality gives upper and lower bounds of edge expansion in normal graphs in terms of the second eigenvalue of the graph’s Laplacian operator. Recently this inequality has been extended to undirected hypergraphs and directed normal graphs via a non-linear operator associated with a diffusion process in the underlying graph. In this work, we develop a uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2021
ISSN: ['1452-8630', '2406-100X']
DOI: https://doi.org/10.2298/aadm180213022s